The remainder when 64^{32^{32}} is divided by | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(D) We need to find the remainder of $64^{32^{32}}$ when divided by $9$.First,note that $64 = 9 	imes 7 + 1$,so $64 \equiv 1 \pmod{9}$.Using the prop

Vedclass · Accepted Answer

$1$

Vedclass · Answer

(D) We need to find the remainder of $64^{32^{32}}$ when divided by $9$.First,note that $64 = 9 	imes 7 + 1$,so $64 \equiv 1 \pmod{9}$.Using the property of modular arithmetic,$a^n \equiv b^n \pmod{m}$ if $a \equiv b \pmod{m}$.Therefore,$64^{32^{32}} \equiv 1^{32^{32}} \pmod{9}$.Since $1$ raised to any positive integer power is $1$,we have $1^{32^{32}} = 1$.Thus,$64^{32^{32}} \equiv 1 \pmod{9}$.The remainder is $1$.

The remainder when $64^{32^{32}}$ is divided by $9$ is equal to .........................

Similar Questions

The remainder left when $8^{2n} - 62^{2n+1}$ is divided by $9$ is:

Show that $9^{n+1}-8n-9$ is divisible by $64$ whenever $n$ is a positive integer.

Let the number $(22)^{2022} + (2022)^{22}$ leave the remainder $\alpha$ when divided by $3$ and $\beta$ when divided by $7$. Then $(\alpha^2 + \beta^2)$ is equal to

If $n \in N$,then ${11^{n + 2}} + {12^{2n + 1}}$ is divisible by

Statement $-1$: For every natural number $n$,$(n + 1)^7 - n^7 - 1$ is divisible by $7$.
Statement $-2$: For every natural number $n$,$n^7 - n$ is divisible by $7$.

Vedclass Test Series

Exam Paper Generator

Online Exam Module